#include <bits/stdc++.h>

using namespace std;

class Solution
{
public:
    int minDistance(string word1, string word2)
    {
        vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1, 0));
        for (size_t i = 1; i < word1.size() + 1; i++)
        {
            for (size_t j = 1; j < word2.size() + 1; j++)
            {
                if (word1[i - 1] == word2[j - 1])
                {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                else
                {
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return static_cast<int>(word1.size() + word2.size() - 2 * dp[word1.size()][word2.size()]);
    }
};

int main()
{
    string word1{"sea"};
    string word2{"eat"};
    Solution sol;
    cout << sol.minDistance(word1, word2) << endl;
    return 0;
}